A modal perspective on defeasible reasoning

نویسنده

  • K. Britz
چکیده

We introduce various new supraclassical entailment relations for defeasible reasoning and investigate some of their relationships. The contrapositive of the usual nonmonotonic preferential entailment turns out to be a monotonic supraclassical entailment. Analogously to these two, a nonmonotonic and its contrapositive monotonic supraclassical entailment can be defined by using modal operators relative to a reflexive accessibility relation instead of a preference order. Then again, by using the strict variant of a preference order on worlds as accessibility relation, modal versions of the usual preferential entailment and its contrapositive are obtained. Proof-theoretic aspects of modal preferential entailment is discussed briefly, leading to a characterization of modular Gödel-Löb logics. The link established between preferential and modal logics make existing modal proof and satisfiability algorithms available for use in preferential logics.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Possible World Semantics for Defeasible Deontic Logic

Defeasible Deontic Logic is a simple and computationally efficient approach for the representation of normative reasoning. Traditionally defeasible logics are defined proof theoretically based on the proof conditions for the logic. While several logic programming, operational and argumentation semantics have been provided for defeasible logics, possible world semantics for (modal) defeasible lo...

متن کامل

On Extending RuleML for Modal Defeasible Logic

In this paper we present a general methodology to extend Defeasible Logic with modal operators. We motivate the reasons for this type of extension and we argue that the extension will allow for a robust knowledge framework in different application areas. The paper presents an extension of RuleML to capture Modal Defeasible Logic.

متن کامل

Two Approaches to the Formalisation of Defeasible Deontic Reasoning

This paper compares two ways of formalising defeasible deontic reasoning , both based on the view that the issues of connicting obligations and moral dilemmas should be dealt with from the perspective of nonmonotonic reasoning. The rst way is developing a special non-monotonic logic for deontic statements. This method turns out to have some limitations, for which reason another approach is reco...

متن کامل

The Making of SPINdle

We present the design and implementation of SPINdle – an open source Java based defeasible logic reasoner capable to perform efficient and scalable reasoning on defeasible logic theories (including theories with over 1 million rules). The implementation covers both the standard and modal extensions to defeasible logics. It can be used as a standalone theory prover and can be embedded into any a...

متن کامل

Characterising Deadlines in Temporal Modal Defeasible Logic

We provide a conceptual analysis of several kinds of deadlines, represented in Temporal Modal Defeasible Logic. The paper presents a typology of deadlines, based on the following parameters: deontic operator, maintenance or achievement, presence or absence of sanctions, and persistence after the deadline. The deadline types are illustrated by a set of examples.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006